On the Stability of Edges in Planar Delaunay Triangulations 1 on the Stability of Edges in Planar Delaunay Triangulations
نویسنده
چکیده
How do errors of measurement a ect a Delaunay triangulation of the measured points? We are given an `exact' and a `measured' set of points P and P 0, respectively, in the plane. The error of measurement is bounded above by ". Obviously, two Delaunay triangulations T of P and T 0 of P 0 may di er in their topologies. However, for certain edges of T we can guarantee that any `measured' triangulation will contain the corresponding edges. These edges are called "-stable. This report shows necessary and su cient conditions for "-stability. Algorithms are proposed for deciding stability with regard to a given " and for determining the supremal " up to which a particular edge is stable. Zusammenfassung Wie wirken sich Me fehler auf eine Delaunay-Triangulierung aus? Gegeben seien eine ,,exakte'' und eine ,,fehlerbehaftete'' Punktmenge P und P 0 in der Ebene. Die Me fehler seien nach oben durch " beschrankt. Es ist o ensichtlich, da zwei Delaunay-Triangulierungen T von P und T 0 von P 0 nicht notwendigerweise in ihrer Struktur ubereinstimmen. F ur bestimmte Kanten von T kann man jedoch garantieren, da auch jede ,,fehlerbehaftete'' Triangulierung T 0 die entsprechenden Kanten enthalten mu . Eine solche Kante nennen wir "-stabil. Dieser Bericht zeigt notwendige und hinreichende Bedingungen f ur "-Stabilit at auf. Er entwickelt Algorithmen zum Test dieser Bedingungen sowie zur Bestimmung des supremalen ", bis zu dem eine Kante stabil bleibt. On the Stability of Edges in Planar Delaunay Triangulations
منابع مشابه
Encoding and Decoding of Planar Maps through Conforming Delaunay Triangulations
This paper describes a method to represent a Planar Map (PM) through a Conforming Delaunay Triangulation (CDT) with applications in a server-client environment. At the server a CDT of the edges of the PM is determined. As the PM is now embedded by the CDT it is sufficient to send to the client the list of coordinates of the CDT nodes and an efficient encoded bitmap of the corresponding PM-CDT e...
متن کاملGood triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give several motivations for considering this heuristic, along with extensive computational results. It turns out that the Delaunay and greedy tria...
متن کاملThe Stability of Delaunay Triangulations
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...
متن کاملTriangulating the Square and Squaring the Triangle : 1 Quadtrees and Delaunay Triangulations are Equivalent
4 We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, 5 we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay 6 triangulation; the second finds the Delaunay triangulation, given a compressed quadtree. Both algorithms 7 run in deterministic linear time on a pointer machine. Our work builds ...
متن کاملAn improved incremental algorithm for constructing restricted delaunay triangulations
This work presents an algorithm that given a generalized planar graph obtains its constrained Delaunay triangulation (CDT). The proposed method, which follows the general approach of [3], works incrementally based on two improved procedures. The first improvement gives a procedure that inserts a new point in a CDT; the second one is an algorithm that enforces a new constraining edge in a CDT. I...
متن کامل